polynomially related

polynomially related
мат.
полиномиально связанный

English-Russian scientific dictionary. 2008.

Смотреть что такое "polynomially related" в других словарях:

  • Communication complexity — The notion of communication complexity was introduced by Yao in 1979,[1] who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n bit string x[clarification needed] and Bob another n bit string… …   Wikipedia

  • Parallel computation thesis — In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by a sequential machine. The parallel computation… …   Wikipedia

  • Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… …   Wikipedia

  • Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Non-standard analysis — Abraham Robinson Gottfried Wilhelm Leibniz argued tha …   Wikipedia

  • Tsirelson space — In mathematics, Tsirelson space T is an example of a reflexive Banach space in which neither an l p space nor a c 0 space can be embedded.It was introduced by B. S. Tsirelson in 1974. In the same year, Figiel and Johnson published a related… …   Wikipedia

  • Nörlund-Rice integral — In mathematics, the Nörlund Rice integral, sometimes called Rice s method, relates the n th forward difference of a function to a line integral on the complex plane. As such, it commonly appears in the theory of finite differences, and also has… …   Wikipedia

  • Nörlund–Rice integral — In mathematics, the Nörlund–Rice integral, sometimes called Rice s method, relates the nth forward difference of a function to a line integral on the complex plane. As such, it commonly appears in the theory of finite differences, and also has… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Randomized algorithm — Part of a series on Probabilistic data structures Bloom filter · Skip list …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»